Multiobjective Optimization Models and solution Methods for Planning land Development using Minimum Spanning Trees, Lagrangian Relaxation and Decomposition Techniques

نویسنده

  • Jose Alberto Faria
چکیده

Title: MULTIOBJECTIVE OPTIMIZATION MODELS AND SOLUTION METHODS FOR PLANNING LAND DEVELOPMENT USING MINIMUM SPANNING TREES, LAGRANGIAN RELAXATION AND DECOMPOSITION TECHNIQUES José Alberto Faria, Doctor of Philosophy, 2005 Directed By: Professor Steven A. Gabriel Department of Civil and Environmental Engineering and Applied Mathematics and Scientific Computation Program University of Maryland The land development problem is presented as the optimization of a weighted average of the objectives of three or more stakeholders, subject to develop within bounds residential, industrial and commercial areas that meet governmental goals. The work is broken into three main sections. First, a mixed integer formulation of the problem is presented along with an algorithm based on decomposition techniques that numerically has proven to outperform other solution methods. Second, a quadratic mixed integer programming formulation is presented including a compactness measure as applied to land development. Finally, to prevent the proliferation of sprawl a new measure of compactness that involves the use of the minimum spanning tree is embedded into a mixed integer programming formulation. Despite the exponential number of variables and constraints required to define the minimum spanning tree, this problem was solved using a hybrid algorithm developed in this research. MULTIOBJECTIVE OPTIMIZATION MODELS AND SOLUTION METHODS FOR PLANNING LAND DEVELOPMENT USING MINIMUM SPANNING TREES, LAGRANGIAN RELAXATION AND DECOMPOSITION TECHNIQUES

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Temporal Decomposition for Improved Unit Commitment in Power System Production Cost Modeling

Long-term planning in electric power systems requires simulations of unit commitment (UC) and economic dispatch (ED) for long time periods up to 20 years. Such simulations are conducted with production cost models (PCMs), which involve solving large-scale mixed-integer programming (MIP) problems with a high number of variables and constraints, because of the long planning horizon. We have devel...

متن کامل

Lagrangian Relaxation Techniques for Scalable Spatial Conservation Planning

We address the problem of spatial conservation planning in which the goal is to maximize the expected spread of cascades of an endangered species by strategically purchasing land parcels within a given budget. This problem can be solved by standard integer programming methods using the sample average approximation (SAA) scheme. Our main contribution lies in exploiting the separable structure pr...

متن کامل

A Comparison of Encodings and Algorithms for Multiobjective Minimum Spanning Tree Problems

Finding minimum-weight spanning trees (MST) in graphs is a classic problem in operations research with important applications in network design. The basic MST problem can be solved eeciently, but the degree constrained and multiobjective versions are NP-hard. Current approaches to the degree-constrained single objective MST include Raidl's evolutionary algorithm (EA) which employs a direct tree...

متن کامل

Weight-Constrained Minimum Spanning Tree Problem

In an undirected graph G we associate costs and weights to each edge. The weight-constrained minimum spanning tree problem is to find a spanning tree of total edge weight at most a given value W and minimum total costs under this restriction. In this thesis a literature overview on this NP-hard problem, theoretical properties concerning the convex hull and the Lagrangian relaxation are given. W...

متن کامل

A Lagrangian Relaxation Approach to the Generalized Minimum Spanning Tree Problem

The Generalized Minimum Spanning Tree Problem, denoted GMST, is a variant of the classical Minimum Spanning Tree problem, and consists of finding a minimum-cost tree spanning a subset of nodes which includes exactly one node from every cluster in an undirected graph whose nodes are partitioned into clusters and whose edges are defined between nodes belonging to different clusters. The GMST prob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005